Implementation of Maximum Likelihood Decoders for Convolutional Codes
نویسنده
چکیده
Maximum likelihood decoding of convolutional codes is finding considerable application in communication systems and several decoders of this type have recently been built. These decoders implement an evolved form of a decoding procedure that was originally described by Viterbi in 1967. In this document we describe the problems of reducing the Viterbi algorithm to hardware, the various tradeoffs and compromises that must be made, and the short cuts that are available. In addition an interesting variation on the Viterbi algorithm is described which results in favorable implementation particularly at high data rates.
منابع مشابه
A Study of Viterbi Decoder Algorithm for Wireless LANs
Viterbi Decoders are commonly used to decode convolutional codes in communications systems. This Viterbi Decoder is a fully parallel implementation which gives fast data throughput. The decoder is targeted for WiMAX and Wireless LAN applications. Input symbol metric pairs are decoded into output data bits by the maximum likelihood Viterbi processor core. Decoder supports both hard and soft inpu...
متن کاملConvolutional Decoders for Amateur Packet Radio
This paper describes two freely available convolutional decoders written in the C language. One implements the Fano algorithm for sequentially decoding three rate l/2 K=32 codes while the other implcmcnts the Viterbi algorithm for maximum likelihood decoding of the rate l/2 K=7 NASA Standard code. Both support 8-W soft-decision decoding with arbitrary metric tables and perform according to theory.
متن کاملAlgebraic aspects of 2D convolutional codes
Two-dimensional (2D) codes are introduced as linear shift-invariant spaces of admissible signals on the discrete plane. Convolutional and, in particular, basic codes are characterized both in terms of their internal properties and by means of their input-output representations. The algebraic structure of the class of all encoders that correspond to a given convolutional code is investigated and...
متن کاملDuality of Channel Encoding and Decoding - Part I: Rate-1 Convolutional Codes
In this paper, we revisit the forward, backward and bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-input soft-output (SISO) maximum a posteriori probability (MAP) decoding process of rate-1 convolutional codes. From this we establish some interesting duality properties between encoding and decoding of rate-1 convolutional codes. We observe that the forward and backward BCJR SISO MAP decoder...
متن کاملAlgebraic aspects of two-dimensional convolutional codes
Abstnrct-Two-dimensional (2-D) codes are introduced as linear shift-invariant spaces of admissible signals on the discrete plane. Convolutional and, in particular, basic codes are characterized both in ter” of their inte-1 properties and by means of their input-output representations. Tbe algebraic structure of the class of all encoders that correspond to a given co~~volutionat code is investig...
متن کامل